Results of the enumeration of Costas arrays of order 29

نویسندگان

  • Konstantinos Drakakis
  • Francesco Iorio
  • Scott T. Rickard
  • John Walsh
چکیده

This correspondence presents the results of the enumeration of Costas arrays of order 27: all arrays found, except for one, are accounted for by the Golomb and Welch construction methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The enumeration of Costas arrays of order 28 and its consequences

The results of the enumeration of Costas arrays of order 28 are presented: all arrays found are accounted for by the Golomb and Welch construction methods, making 28 the first order (larger than 5) for which no sporadic Costas arrays exist. The enumeration was performed on several computer clusters and required the equivalent of 70 years of single CPU time. Furthermore, a classification of Cost...

متن کامل

Enumeration of Parallelograms in Permutation Matrices for Improved Bounds on the Density of Costas Arrays

A Costas array of order n is an n× n permutation matrix such that all vectors between pairs of ones are distinct. Thus, a permutation matrix fails to be a Costas array if and only if it contains ones that form a (possibly degenerate) parallelogram. In this paper, we enumerate parallelograms in an n × n permutation matrix. We use our new formulas to improve Davies’s O(n−1) result for the density...

متن کامل

Algebraic Symmetries of Generic Multidimensional Periodic Costas Arrays and their importance in the enumeration of Multidimensional Periodic Sonar Arrays

We present two symmetries of the generic multidimensional periodic Costas arrays over elementary abelian groups. Through exhaustive search, we observe that these two symmetries generate the Costas arrays for the enumeration up to p = 5 (5x5x24). Following the results, we conjecture that these generators characterize the group of symmetries of the generic (m+1)-dimensional periodic Costas arrays...

متن کامل

A Recursive Method for Enumeration of Costas Arrays

In this paper, we propose a recursive method for finding Costas arrays that relies on a particular formation of Costas arrays from similar patterns of smaller size. By using such an idea, the proposed algorithm is able to dramatically reduce the computational burden (when compared to the exhaustive search), and at the same time, still can find all possible Costas arrays of given size. Similar t...

متن کامل

Parity properties of Costas arrays defined via finite fields

A Costas array of order n is an arrangement of dots and blanks into n rows and n columns, with exactly one dot in each row and each column, the arrangement satisfying certain specified conditions. A dot occurring in such an array is even/even if it occurs in the i-th row and j-th column, where i and j are both even integers, and there are similar definitions of odd/odd, even/odd and odd/even do...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2008